A Tight Estimate for Decoding Error-Probability of LT Codes Using Kovalenko's Rank Distribution

نویسندگان

  • Ki-Moon Lee
  • Hayder Radha
  • Beom-Jin Kim
چکیده

A new approach for estimating the Decoding ErrorProbability (DEP) of LT codes with dense rows is derived by using the conditional Kovalenko’s rank distribution. The estimate by the proposed approach is very close to the DEP approximated by Gaussian Elimination, and is significantly less complex. As a key application, we utilize the estimates for obtaining optimal LT codes with dense rows, whose DEP is very close to the Kovalenko’s Full-Rank Limit within a desired error-bound. Experimental evidences which show the viability of the estimates are also provided.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Kovalenko's Full-Rank Limit and Overhead as Lower Bounds for Error-Performances of LDPC and LT Codes over Binary Erasure Channels

We present Kovalenko’s full-rank limit as a tight lower bound for decoding error probability of LDPC codes and LT codes over BEC. From the limit, we derive a full-rank overhead as a lower bound for stable overheads for successful maximum-likelihood decoding of the codes.

متن کامل

A Tight Estimate for Decoding Error-Probability of LT Codes with Dense Rows

A novel approach of estimating Decoding Error-Probability (DEP) of LT codes, using the conditional Kovalenko’s Rank-Distribution, is proposed. The estimate is utilized for constructing optimal LT codes with dense rows achieving the DEP that is very close to Kovalenko’s FullRank Limit. Experimental evidences which show the viability of the estimate is also provided. INTRODUCTION AND BACKGROUNDS ...

متن کامل

Fountain Codes under Maximum Likelihood Decoding

This dissertation focuses on fountain codes under maximum likelihood (ML) decoding. Fountain codes are a class of erasure correcting codes that can generate an endless amount of coded symbols and were conceived to deliver data files over data networks to a potentially large population of users. First Luby transform (LT) codes are considered, which represent the first class of practical fountain...

متن کامل

On the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes

Rank metric codes can either be used as such for error correction in data storage equipments, or be lifted into constant-dimension codes (CDCs) and thus be used for error correction in random network coding. This paper investigates the decoder error probability (DEP) of rank metric codes and CDCs. We first study the DEP of rank metric codes using a bounded rank distance decoder. We derive asymp...

متن کامل

Evaluate the Word Error Rate of Binary Block Codes with Square Radius Probability Density Function

The word error rate (WER) of soft-decision-decoded binary block codes rarely has closed-form. Bounding techniques are widely used to evaluate the performance of maximum-likelihood decoding algorithm. But the existing bounds are not tight enough especially for low signal-to-noise ratios and become looser when a suboptimum decoding algorithm is used. This paper proposes a new concept named square...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/0901.1762  شماره 

صفحات  -

تاریخ انتشار 2009